变分自编码器模型综述

变分自编码器（VAE）作为深度隐空间生成模型的一种，近年来其表现性能取得了极大的成功，尤其是在图像生成方面。变分自编码器模型作为无监督式特征学习的重要工具之一，可以通过学习隐编码空间与数据生成空间的特征映射，进而在输出端重构生成输入数据。梳理了传统变分自编码器模型及其衍生变体模型的发展与研究现状，并就此做了总结和对比，最后分析了变分自编码器模型存在的问题与挑战，并就可能的发展趋势做了展望。     

An adjusted K‐medoids clustering algorithm for effective stability in vehicular ad hoc networks

Recently, the routing problem in vehicular ad hoc networks is one of the most vital research. Despite the variety of the proposed approaches and the development of communications technologies, the routing problem in VANET suffers from the high speed of vehicles and the repetitive failures in communications. In this paper, we adjusted the well‐known K‐medoids clustering algorithm to improve the network stability and to increase the lifetime of all established links. First, the number of clusters and the initial cluster heads will not be selected randomly as usual, but based on mathematical formula considering the environment size and the available transmission ranges. Then the assignment of nodes to clusters in both k‐medoids phases will be carried out according to several metrics including direction, relative speed, and proximity. To the best of our knowledge, our proposed model is the first that introduces the new metric named “node disconnection frequency.” This metric prevents nodes with volatile and suspicious behavior to be elected as a new CH. This screening ensures that the new CH retains its property as long as possible and thus increases the network stability. Empirical results confirm that in addition to the convergence speed that characterizes our adjusted K‐medoids clustering algorithm (AKCA), the proposed model achieves more stability and robustness when compared with most recent approaches designed for the same objective.     

基于k-shell的复杂网络最短路径近似算法

复杂网络最短路径经典算法的处理效率较低，不适用于大规模复杂网络，而现有近似算法通用性有限，且计算准确率不理想，不能满足规模日益扩大的复杂网络中的最短路径计算需求。针对于此，提出基于[k]-shell的复杂网络最短路径近似算法。算法利用节点的[k]-shell值进行网络划分并引导搜索路径，利用超点聚合处理[k]-shell子网来降低路径搜索中节点和连边的规模，通过在路径搜索过程使用双向搜索树方法提高算法的计算效率和准确率。实验结果表明，算法通用性较好，在现实与仿真大规模复杂网络中均具有较高的计算效率和准确率。     

基于概要数据结构的全网络持续流检测方法

持续流是隐蔽的网络攻击过程中显现的一种重要特征，它不产生大量流量且在较长周期内有规律地发生，给传统的检测方法带来极大挑战。针对网络攻击的隐蔽性、单监测点的重负荷和信息有限的问题，提出全网络持续流检测方法。首先，设计一种概要数据结构，并将其部署在每个监测点；其次，当网络流到达监测点时，提取流的概要信息并更新概要数据结构的一位；然后，在测量周期结束时，主监测点将来自其他监测点的概要信息进行综合；最后，提出流持续性的近似估计，通过一些简单计算为每个流构建一个位向量，利用概率统计方法估计流持续性，使用修正后的持续性估计检测持续流。通过真实的网络流量进行实验，结果表明，与长持续时间流检测算法（TLF）相比，所提方法的准确性提高了50%，误报率和漏报率分别降低了22%和20%，说明全网络持续流检测方法能够有效监测高速网络流量。     

核磁共振方法研究油水过渡带驱替特征

目前,利用常规手段难以对低含油饱和度油水过渡带进行开采,利用气驱及化学驱方式开采仍具有开发潜力,但对于不同类型的油水过渡带,其开发机理不明确。开展4组天然岩心驱替实验,利用核磁共振技术研究不同类型油水过渡带中剩余油的启动机理和主要分布状态,在此基础上研究油水过渡带的开发特征。实验结果表明,气驱开发方式更适用于低渗岩心;化学驱的乳化及降低表面张力作用对小孔隙中剩余油有较好的动用程度,提高采收率效果显著。     

具有自动装卸搬运机器人的制造单元建模与分析

针对具有自动装卸搬运机器人的制造单元，着重考虑其双重资源约束的特点，提出了该系统的有限缓冲开排队网的建模方法。根据工件的加工、装卸与搬运等工艺流程，定义该系统的排队网模型的各种状态，基于连续时间马尔可夫链，采用精确解法对该模型进行分析求解，获得系统一系列的稳态性能指标。为了验证排队网建模方法的有效性，建立其对应的仿真模型，分别采用排队网模型的数值计算与仿真模型的仿真统计2种方法求出系统的性能指标进行对比，并基于排队网模型对该制造单元的系统性能进行分析，为该类制造单元的资源配置优化和设施布局优化等问题提供重要的理论支撑。     

An improved cuckoo search algorithm for the problem of electric distribution network reconfiguration

Power loss reduction has an important role in operating electric distribution network system. There are a lot of methods for reduction power loss such as capacitor placement, distributed generation placement and electric distribution network reconfiguration (EDNR). Among these methods, the EDNR is an efficient technique to reduce power loss due to without taking any costs. However, the EDNR problem is a nonlinear, discrete problem and lots of extreme points. Therefore, it is necessary to have efficient methods for solving the EDNR problem. In this paper, an improved cuckoo search algorithm (ICSA) is proposed for solving the EDNR problem. In which, based on disadvantages of exploration and exploitation process of cuckoo search algorithm (CSA) for solving the EDNR problem, a local search mechanism is added to exploit candidate solutions existing around the current best solution. The calculated results on the simple distribution networks to complex distribution networks show that ICSA has ability for finding the global optimal solution with much smaller iterations and better quality of obtained solution compared with CSA and some other improved versions of CSA. The performance comparisons with other existing methods available in previous studies and the software of Power System Simulator/Advanced Distribution Engineering Productivity Tool (PSS/ADEPT) also lead to the better electric distribution network configuration with smaller total power losses. As a result, ICSA is a potential and reliable method for solving the EDNR problems.     

An integrated approach for aircraft turbofan engine fault detection based on data mining techniques

The present study proposes an algorithm for fault detection in terms of condition‐based maintenance with data mining techniques. The proposed algorithm is applied on an aircraft turbofan engine using flight data and consists of two main sections. In the first section, the relationship between engine exhaust gas temperature (EGT) as the main engine health monitoring criterion and other operational and environmental parameters of the engine was modelled using the data‐driven models. In the second section, a data set including EGT residuals, that is, the difference between the actual EGT of the system and the EGT estimated by the developed model in the health conditions of the engine, was created. Finally, faults occurring in each flight were detected based on the identification of abnormal events by a one‐class support vector machine trained by the health condition EGT residual data set. The results indicated that the proposed algorithm was an effective approach for inspecting aircraft engine conditions and detecting faults, with no need for technical knowledge on the interior characteristics of the aircraft engine.     

ATSP:时态网络可视化的自适应时间片划分方法

现有的时态网络可视化方法大多采用等量时间片来可视化网络的演变，不利于时态模式的快速挖掘和发现。为此，根据时态网络固有的特征提出自适应时间片划分方法（Adaptive Time Slice Partition method，ATSP）。在时态网络的两种表示方式（基于事件的表示方式和基于快照的表示方式）的基础上，构建了ATSP的基础模型，同时提出了一种改进模型用来描述事件间隔时间服从长尾分布的时态网络。为了实现时间片的不等量划分，针对探索任务的不同提出了基于时态模式的ATSP规则和基于中心节点的ATSP规则，并提出了实现算法--层次划分算法（Hierarchical Partition algorithm，HP）和增量划分算法（Incremental Partition algorithm，IP）。实验结果表明，ATSP方法比传统的时间片划分方法更能准确地表示网络的时态特征，且该方法应用于可视化时，能有效归纳并展示网络的特征，明显提高了视觉分析的效率。     

大规模生物网络马尔可夫聚类的并行化算法

马尔可夫聚类算法（MCL）是在大规模生物网络中寻找模块的一个有效方法，能够挖掘网络结构和功能影响力较大的模块。算法涉及到大规模矩阵计算，因此复杂度可达立方阶次。针对复杂度高的问题，提出了基于消息传递接口（MPI）的并行化马尔可夫聚类算法以提高算法的计算性能。首先，生物网络转化成邻接矩阵；然后，根据算法的特性，按照矩阵的规模判断并重新生成新矩阵以处理非平方倍数矩阵的计算；其次，并行计算通过按块分配的方式能够有效地实现任意规模矩阵的运算；最后，循环并行计算直至收敛，得到网络聚类结果。通过模拟网络和真实生物网络数据集的实验结果表明，与全块集体式通信（FCC）并行方法相比，平均并行效率提升了10个百分点以上，因此可以将该优化算法应用在不同类型的大规模生物网络中。